Nonexistence of a [g_q (5, d), 5, d]_q code for 3q⁴ -4q³-2q + 1 ≤ d ≤ 3q⁴ -4q³-qCHEON, E. J; KATO, T; KIM, S. J et al.Discrete mathematics. 2008, Vol 308, Num 14, pp 3082-3089, issn 0012-365X, 8 p.Conference Paper

Extensions of the critical theoremBRITZ, Thomas.Discrete mathematics. 2005, Vol 305, Num 1-3, pp 55-73, issn 0012-365X, 19 p.Article

Linear intersecting codesCOHEN, G; LEMPEL, A.Discrete mathematics. 1985, Vol 56, Num 1, pp 35-43, issn 0012-365XArticle

A new proof of Korzhik's result on burst distributionsSIRI KRISHAN WASAN.Linear algebra and its applications. 1984, Vol 59, pp 115-119, issn 0024-3795Article

Linear unequal error protection codes from shorter codesVAN GILS, W. J.IEEE transactions on information theory. 1984, Vol 30, Num 3, pp 544-546, issn 0018-9448Article

A method for extending binary linear codesALLTOP, W. O.IEEE transactions on information theory. 1984, Vol 30, Num 6, pp 871-872, issn 0018-9448Article

Some results on the existence of binary linear codesELIA, M.IEEE transactions on information theory. 1983, Vol 29, Num 6, pp 933-934, issn 0018-9448Article

Optimal lower bounds for 2-query locally decodable linear codesOBATA, Kenji.Lecture notes in computer science. 2002, pp 39-50, issn 0302-9743, isbn 3-540-44147-6, 12 p.Conference Paper

Binomial coefficient codes over GF(2)DIACONIS, P; GRAHAM, R.Discrete mathematics. 1992, Vol 106-7, pp 181-188, issn 0012-365XArticle

Dual product constructions of Reed―Muller type codesPHELPS, K. T.IEEE transactions on information theory. 1986, Vol 32, Num 1, pp 103-106, issn 0018-9448Article

Linear codes arising from the Gale transform of distinguished subsets of some projective spacesCOSSIDENTE, Antonio; SONNINO, Angelo.Discrete mathematics. 2012, Vol 312, Num 3, pp 647-651, issn 0012-365X, 5 p.Conference Paper

Covering radii are not matroid invariantsBRITZ, Thomas; RUTHERFORD, Carrie G.Discrete mathematics. 2005, Vol 296, Num 1, pp 117-120, issn 0012-365X, 4 p.Article

PD-sets for binary RM-codes and the codes related to the Klein quadric and to the Schubert variety of PG(5,2)KROLL, Hans-Joachim; VINCENTI, Rita.Discrete mathematics. 2008, Vol 308, Num 2-3, pp 408-414, issn 0012-365X, 7 p.Conference Paper

On the Minimum Distance Conjecture for Schubert CodesXU XIANG.IEEE transactions on information theory. 2008, Vol 54, Num 1, pp 486-488, issn 0018-9448, 3 p.Article

Higher support matroidsBRITZ, Thomas.Discrete mathematics. 2007, Vol 307, Num 17-18, pp 2300-2308, issn 0012-365X, 9 p.Article

Algorithmic Construction of Efficient Fractional Factorial Designs With Large Run SizesHONGQUAN XU.Technometrics. 2009, Vol 51, Num 3, pp 262-277, issn 0040-1706, 16 p.Article

PD-sets for the codes related to some classical varietiesKROLL, Hans-Joachim; VINCENTI, Rita.Discrete mathematics. 2005, Vol 301, Num 1, pp 89-105, issn 0012-365X, 17 p.Conference Paper

An Upper Bound of Singleton Type for Componentwise Products of Linear CodesRANDRIAMBOLOLONA, Hugues.IEEE transactions on information theory. 2013, Vol 59, Num 12, pp 7936-7939, issn 0018-9448, 4 p.Article

Code Enumerators and Tutte PolynomialsBRITZ, Thomas.IEEE transactions on information theory. 2010, Vol 56, Num 9, pp 4350-4358, issn 0018-9448, 9 p.Article

Generalized MacWilliams identities for Z₄-Linear codesJIE CUI; JUNYING PEI.IEEE transactions on information theory. 2004, Vol 50, Num 12, pp 3302-3305, issn 0018-9448, 4 p.Article

Good Linear Codes from Polynomial EvaluationsYANG DING; LINGFEI JIN; CHAOPING XING et al.IEEE transactions on communications. 2012, Vol 60, Num 2, pp 357-363, issn 0090-6778, 7 p.Article

There Is No Binary [35, 10, 13] CodeTJHAI, Cen J; TOMLINSON, Martin; GRASSL, Markus et al.IEEE transactions on information theory. 2011, Vol 57, Num 9, pp 6094-6096, issn 0018-9448, 3 p.Article

The Average Value for the Probability of an Undetected ErrorPERRY, Patrick N; FOSSORIER, P. C.IEEE transactions on information theory. 2008, Vol 54, Num 5, pp 2372-2375, issn 0018-9448, 4 p.Article

The Weight Distribution of Some Irreducible Cyclic CodesCUNSHENG DING.IEEE transactions on information theory. 2009, Vol 55, Num 3, pp 955-960, issn 0018-9448, 6 p.Article

Finding Good Linear Codes Using a Simple Extension AlgorithmHAN, Sunghyu.IEEE transactions on information theory. 2011, Vol 57, Num 10, pp 6729-6733, issn 0018-9448, 5 p.Article